Sorted Bigraphs∗ Draft!

نویسندگان

  • Lars Birkedal
  • Søren Debois
  • Thomas Hildebrandt
چکیده

Building upon work of Milner, Leifer, Jensen and ourselves, we develop a theory of sorted bigraphical reactive systems. Concretely, we show how to automatically get a sorting on bigraphs sustaining the behavioural theory of pure bigraphical reactive systems by lifting a safe sorting on the underlying reactive system of abstract bigraphs. We back this result by a general construction of a safe sorting, the Closure sorting. This sorting restricts a reactive system, and thus by the main result any bigraphical reactive system, to the contexts satisfying any given decomposable predicate. We demonstrate the applicability of the Closure sorting by proving that Milner’s Local Bigraphs arise as a closure sorting of pure bigraphs, using part of the usual scoping condition as predicate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Construction of Sorted Bigraphical Reactive Systems

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings for bigraphical reactive systems; a construct...

متن کامل

On the Construction of Sorted Reactive Systems

We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the ...

متن کامل

Towards a Bigraphical Encoding of Actors

Actors are self-contained, concurrently interacting entities of a computing system. They can perform local computations, communicate via asynchronous message passing with other actors and can be dynamically created. Bigraphs are a fully graphical process algebraic formalism, capable of representing both the position in space of agents and their inter-connections. Their behaviour is specified by...

متن کامل

A bigraphical model of the simply typed λ-calculus

We present a model of the simply typed λ-calculus as a simply typed explicit substitution calculus encoded in a bigraphical reactive system. The reactive system combines a previous model by Milner with a sorting of the place graph structure which is defined using a generalisation of our previous work on kind sortings. The model demonstrates the expressiveness of these sortings. We identify some...

متن کامل

Sortings & Bigraphs

In this dissertation, we study sortings for reactive and bigraphical reactive systems. Both classes of systems have transitions derived from reactions in such a way that if the category underlying the system in question has sufficient relative pushouts, then bisimulation on the derived transitions will be congruence. It turns out that every application of bigraphical reactive systems in the lit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007